翻訳と辞書 Words near each other ・ Contra Celsum ・ Contra Conspiracy ・ Contra Costa ・ Contra Costa Canal ・ Contra Costa Centre, California ・ Contra Costa College ・ Contra Costa Community College District ・ Contra Costa County Board of Supervisors ・ Contra Costa County Employees' Retirement Association ・ Contra Costa County Library ・ Contra Costa County Superior Court ・ Contra Costa County, California ・ Contra Costa Times ・ Contra Dam ・ Contra dance ・ Continuous quantum computation ・ Continuous reactor ・ Continuous redial ・ Continuous revelation ・ Continuous scan laser Doppler vibrometry ・ Continuous signal ・ Continuous simulation ・ Continuous slowing down approximation range ・ Continuous spatial automaton ・ Continuous spectrum ・ Continuous spontaneous ventilation ・ Continuous stationery ・ Continuous stirred-tank reactor ・ Continuous stochastic process ・ Continuous subscription service Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Continuous quantum computation ： ウィキペディア英語版 Continuous quantum computation Two major motivations for studying continuous quantum computation are: * Many scientific problems have continuous mathematical formulations. Examples of such formulations are * * Path integration * * Feynman–Kac path integration * * Schrödinger equation * In their standard monograph Nielsen and Chuang state "Of particular interest is a decisive answer to the problem whether quantum computers are more powerful than classical computers." To answer this question one must know the classical and quantum computational complexities We discuss the second motivation. By computational complexity (complexity for brevity) is meant the minimal computational resources needed to solve a problem. Two of the most important resources for quantum computing are qubits and queries. Classical complexity has been extensively studied in information-based complexity. The classical complexity of many continuous problems is known. Therefore, when the quantum complexity of these problems is obtained, the question as to whether quantum computers are more powerful than classical can be answered. Furthermore, it can be established how much more powerful. In contrast, the complexity of discrete problems is typically unknown; one has to settle for the complexity hierarchy. For example, the classical complexity of integer factorization is unknown. ==An example: path integration== Path integration has numerous applications including quantum mechanics, quantum chemistry, statistical mechanics, and computational finance. We want to compute an approximation to within error at most $\backslash scriptstyle\backslash varepsilon$ with probability, say, at least 3/4. Then the following was (shown ) by Traub and Woźniakowski: * A quantum computer enjoys exponential speedup over the classical worst case and quadratic speedup over the classical randomized case. * The query complexity is of order $\backslash scriptstyle\backslash varepsilon^$. * The qubit complexity is of order $\backslash scriptstyle\backslash varepsilon^\backslash log\backslash varepsilon^$. Thus the qubit complexity of path integration is a second degree polynomial in $\backslash scriptstyle\backslash varepsilon^$. That seems pretty good but we probably won't have enough qubits for a long time to do new science especially with error correction. Since this is a complexity result we can't do better by inventing a clever new algorithm. But perhaps we can do better by slightly modifying the queries. In the standard model of quantum computation the probabilistic nature of quantum computation enters only through measurement; the queries are deterministic. In analogy with classical Monte Carlo Woźniakowski introduced the idea of a quantum setting with (randomized queries ). He showed that in this setting the qubit complexity is of order $\backslash scriptstyle\; \backslash log\backslash varepsilon^$, thus achieving an exponential improvement over the qubit complexity in the standard quantum computing setting. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Continuous quantum computation」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.